On Modulo-Sum Computation Over an Erasure Multiple-Access Channel
نویسندگان
چکیده
منابع مشابه
Reliable Computation over Multiple-Access Channels
In the standard multiple-access problem, a central access point needs to reconstruct the signals observed by each user separately. Suppose now that the access point only reconstructs the sum (or any other function) of these observed signals. For this problem, we develop strategies and information-theoretic performance bounds. It is shown that in general, separating source from channel coding le...
متن کاملOn $\ell_p$-norm Computation over Multiple-Access Channels
This paper addresses some aspects of the general problem of information transfer and distributed function computation in wireless networks. Many applications of wireless technology foresee networks of autonomous devices executing tasks that can be posed as distributed function computation. In today’s wireless networks, the tasks of communication and (distributed) computation are performed separ...
متن کاملDecoding of 2D convolutional codes over an erasure channel
In this paper we address the problem of decoding 2D convolutional codes over the erasure channel. To this end we introduce the notion of balls around a burst of erasures which can be considered an analogue of the notion of sliding window in the context of 1D convolutional codes. The main idea is to reduce the decoding problem of 2D convolutional codes to a problem of decoding a set of associate...
متن کاملA Dual Decomposition Approach to the Sum Power Gaussian Vector Multiple Access Channel Sum Capacity Problem
The Gaussian vector multiple access channel with a sum-power constraint across all users, rather than the usual individual power constraint on each user, has recently been shown to be the dual of a Gaussian vector broadcast channel [1] [2]. Further, a numerical algorithm for the sum capacity under the sum power constraint has been proposed in [3]. This paper proposes a different algorithm for t...
متن کاملInterleaver-Division Multiple Access on the OR Multiple Access Channel
The OR channel provides an unusual opportunity where single-user decoding permits operation at about 70% of the full multiple-access channel sum capacity. The interleaverdivision multiple access technique applied in this paper can approach that performance with turbo and LDPC solutions. The current paper focuses on very low latency codes with simple Viterbi decoding, intended for very high spee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2013.2252234